Enumeration of Enumeration Algorithms

نویسنده

  • Kunihiro Wasa
چکیده

In this paper, we enumerate enumeration problems and algorithms. Other useful catalogues for enumeration algorithms are provided by Komei Fukuda and Yasuko Matsui. This survey is under construction. If you know some results not in this survey or there is anything wrong, please let me know.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact algorithms for solving a bi-level location–allocation problem considering customer preferences

The issue discussed in this paper is a bi-level problem in which two rivals compete in attracting customers and maximizing their profits which means that competitors competing for market share must compete in the centers that are going to be located in the near future. In this paper, a nonlinear model presented in the literature considering customer preferences is linearized. Customer behavior ...

متن کامل

Suitability of MRS-bile Agar for the Selective Enumeration of Mixed Probiotic Bacteria in Presence of Mesophilic Lactic Acid Cultures and Yoghurt Bacteria

Measuring the viability of probiotic microorganisms in food products using plate count methodology is a common practice due to the simplicity (ease of performance), inexpensive and routine testing characters ofthis method. In present study, the suitability of de man rogosa and sharpe agar (MRS) bile agar medium forthe selective enumeration of mixed probiotic bacteria (Lactobacillus ...

متن کامل

Type-Itemized Enumeration of RS-Stereoisomers of Octahedral Complexes

Stereoisograms of octahedral complexes are classified into five types (type I--typeV) under the action of the corresponding RS-stereoisomeric group. Their enumeration is accomplished in a type-itemized fashion, where Fujita's proligand method developed originally for combinatorial enumeration under point groups (S. Fujita, Theor. Chem. Acc., 113, 73--79 (2005)) is extended to meet the requireme...

متن کامل

Open Problems of the Lorentz Workshop “Enumeration Algorithms using Structure”

This is a collection of open problems presented at the Lorentz Workshop “Enumeration Algorithms using Structure” which took place at the Lorentz Center of the University of Leiden (The Netherlands), August 24 30, 2015. The workshop brought together researchers interested in various aspects of enumeration algorithms; in particular classical output-sensitive enumeration including output-polynomia...

متن کامل

Algorithms for Propositional Model Enumeration and Counting

A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and hybrid solvers. Besides practical applications, the problem of counting propositional models is of key relevancy in computational complexity. In recent years a number of algorithms have been proposed for propositional ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1605.05102  شماره 

صفحات  -

تاریخ انتشار 2016